Purification in the Infinitely-Repeated Prisoners’ Dilemma∗
نویسندگان
چکیده
This paper investigates the Harsanyi (1973)-purifiability of mixed strategies in the repeated prisoners’ dilemma with perfect monitoring. We perturb the game so that in each period, a player receives a private payoff shock which is independently and identically distributed across players and periods. We focus on the purifiability of one-period memory mixed strategy equilibria used by Ely and Välimäki (2002) in their study of the repeated prisoners’ dilemma with private monitoring. We find that any such strategy profile is not the limit of one-period memory equilibrium strategy profiles of the perturbed game, for almost all noise distributions. However, if we allow infinite memory strategies in the perturbed game, then any completely-mixed equilibrium is purifiable.
منابع مشابه
Sequential Equilibria in the Repeated Prisoners’ Dilemma with Private Monitoring
We analyze the infinitely repeated prisoners’ dilemma with imperfect private monitoring. The efficient outome can be approximated in any prisoners’ dilemma game, while every individually rational feasible payoff can be approximated in a class of prisoner dilemma games. Our results require that monitoring be sufficiently accurate but do not require very low discounting.
متن کاملTacit Collusion in an Infinitely Repeated Prisoners’ Dilemma
In the context of an infinitely repeated Prisoners’ Dilemma, we explore how cooperation is initiated when players communicate and coordinate through their actions. There are two types of players patient and impatient which are private information. An impatient type is incapable of cooperative play, while if both players are patient types and this is common knowledge then they can cooperate with...
متن کاملSignaling and tacit collusion in an infinitely repeated Prisoners' Dilemma
In the context of an infinitely repeated Prisoners’ Dilemma, we explore how cooperation is initiated when players signal and coordinate through their actions. There are two types of players patient and impatient and a player’s type is private information. An impatient type is incapable of cooperative play, while if both players are patient types and this is common knowledge then they can cooper...
متن کاملPrisoners' Dilemma Supergame on Rectangle Lattice
In this paper a class of large supergames, i.e., infinitely repeated games played by many players are studied. The players located on the vertex set of planar rectangle lattice play several basic games with his neighbors. The basic game is two-person prisoners’ dilemma game with asymmetric payoffs. Under the conditions of the pre-specified updating rules and the transition probabilities, the re...
متن کاملCooperation cannot be sustained in a Discounted Repeated Prisoners’ Dilemma with Patient Short and Long Run Players
This study presents a modified version of the repeated discounted prisoners’ dilemma with long and short-run players. In our setting a short-run player does not observe the history that has occurred before he was born, and survives into next phases of the game with a probability given by the current action profile in the stage game. Thus, even though it is improbable, a short-run player may liv...
متن کامل